Upper bound on Randić energy of some graphs
نویسندگان
چکیده
منابع مشابه
Hermitian-Randić matrix and Hermitian-Randić energy of mixed graphs
Let M be a mixed graph and [Formula: see text] be its Hermitian-adjacency matrix. If we add a Randić weight to every edge and arc in M, then we can get a new weighted Hermitian-adjacency matrix. What are the properties of this new matrix? Motivated by this, we define the Hermitian-Randić matrix [Formula: see text] of a mixed graph M, where [Formula: see text] ([Formula: see text]) if [Formula: ...
متن کاملOn upper bound graphs whose complements are also upper bound graphs
In this paper, we consider upper bound graphs and double bound graphs of posets. We obtain a characterization of upper bound graphs whose complements are also upper bound graphs as follows: for a connected graph G, both G and G are upper bound graphs if and only if G is a split graph with V(G)= K + S, where K is a clique and S is an independent set, satisfying one of the following conditions: (...
متن کاملSome upper bounds for the energy of graphs
LetG = (V, E)be a graphwith n vertices and e edges.Denote V (G) = {v1, v2, . . . , vn}. The 2-degree of vi , denoted by ti , is the sum of degrees of the vertices adjacent to vi , 1 i n. Let σi be the sum of the 2-degree of vertices adjacent to vi . In this paper, we present two sharp upper bounds for the energy of G in terms of n, e, ti , and σi , from which we can get some known results. Also...
متن کاملThe upper bound on k-tuple domination numbers of graphs
In a graph G, a vertex is said to dominate itself and all vertices adjacent to it. For a positive integer k, the k-tuple domination number γ×k(G) of G is the minimum size of a subset D of V (G) such that every vertex in G is dominated by at least k vertices in D. To generalize/improve known upper bounds for the k-tuple domination number, this paper establishes that for any positive integer k an...
متن کاملA New Upper Bound On Forwarding Index of Graphs
To measure the efficiency of a routing in network, Chung et al [The forwarding index of communication networks. IEEE Trans. Inform. Theory, 33 (2) (1987), 224-232] proposed the notion of forwarding index and established the tight upper bound (n − 1)(n − 2) for a connected graph of order n. This note improves this bound in terms of order n and maximum degree ∆ to the tight upper bound (n−1)(n−2)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2015
ISSN: 0024-3795
DOI: 10.1016/j.laa.2015.03.039